Controlling rewriting by rewriting

نویسندگان

  • Peter Borovanský
  • Claude Kirchner
  • Hélène Kirchner
چکیده

In this paper, we investigate the idea of controlling rewriting by strategies and we develop a strategy language whose operational semantics is also based on rewriting. This language is described in ELAN, a language based on computational systems that are simply rewriting theories controlled by strategies. We illustrate the syntax, semantics and diierent features of this strategy language. Finally, we sketch its bootstrapping implementation by a transformation into a computational system, whose heart is a rewrite theory controlled by a lower-level strategy of ELAN.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A User Interface for Controlling Term Rewriting Based on Computing-as-Editing Paradigm

On a logically structured document, such as a formal proof, pieces of information are related by various kinds of constraint. Computing-as-editing paradigm (CAEP) was previously proposed as a principle for designing environments for editing such documents. In this paradigm, the process of editing a document is considered to include setting and solving constraints, and constraint solving is cons...

متن کامل

Algebraic Matching of Vulnerabilities in a Low-Level Code

This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...

متن کامل

Strategic programming on graph rewriting systems

Rewriting [4] is a computation model used in computer science, algebra, logic and linguistics, amongst others. Its purpose is to transform syntactic objects (words, terms, programs, proofs, graphs, etc., which we will call generally expressions), by applying rewrite rules until a suitable simplied form is obtained. Given an expression and a set of rewrite rules, it is often the case that severa...

متن کامل

Validation of the Historical Reports of the Book “Estitār al-Emām” A Source for Rewriting the Political-Cultural History of the Pre-African Ismailis

Abstract In this article, by comparing the historical reports of the book Estirār al-Emām with the reports of non-Ismaili sources, an attempt is made to examine and analyze the validity of this book as a historiographical source in reconstructing the history of the Ismailis before 297 AH. The results show that a critical reference to Ismaili works along with non-Ismaili sources can be an impor...

متن کامل

A Simplifier for Untyped Lambda Expressions bY

Many applicative programming languages are based on the call-by-value lambda calculus. For these languages tools such as compilers, pa.rtial evaluators, and other transformation systems often make use of rewriting systems that incorporate some form of beta reduction. For purposes of automatic rewriting it is important to develop extensions of beta-value reduction and to develop methods for guar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 4  شماره 

صفحات  -

تاریخ انتشار 1996